bisection algorithm

См. также в других словарях:

• Bisection method — A few steps of the bisection method applied over the starting range [a1;b1]. The bigger red dot is the root of the function. The bisection method in mathematics is a root finding method which repeatedly bisects an interval and then selects a… …   Wikipedia

• Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… …   Wikipedia

• Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… …   Wikipedia

• Lehmer-Schur algorithm — In mathematics, the Lehmer Schur algorithm is a root finding algorithm extending the one dimensional bracketing used by the bisection method to find the roots of a function of one complex variable inside any rectangular region of the function s… …   Wikipedia

• Ziggurat algorithm — The ziggurat algorithm is an algorithm to generate random numbers from a non uniform distribution. It belongs to the class of rejection sampling algorithms and can be used for choosing values from a monotone decreasing probability distribution.… …   Wikipedia

• Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… …   Wikipedia

• Ostomachion — (after Suter; this version requires a lateral stretch by a factor of two to match that in the Archimedes Palimpsest) …   Wikipedia

• Viscoplasticity — Figure 1. Elements used in one dimensional models of viscoplastic materials. Viscoplasticity is a theory in continuum mechanics that describes the rate dependent inelastic behavior of solids. Rate dependence in this context means that the… …   Wikipedia

• Herbert Wilf — Herbert Saul Wilf (* 1931) ist ein US amerikanischer Mathematiker, der sich mit Kombinatorik beschäftigt. Wilf wurde 1958 an der Columbia University bei Herbert Robbins promoviert (Transitions of neutrons in multilayered slab geometry), wie er… …   Deutsch Wikipedia

• алгоритм деления пополам — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN bisection algorithm …   Справочник технического переводчика

• Bisect — Bisection is the general activity of dividing something into two parts.Bisect may mean:*bisection, in geometry, dividing something into two equal parts * bisection of earthworms to study regeneration *bisect (philately), the use of postage stamp… …   Wikipedia